Distance-two labellings of Hamming graphs
نویسندگان
چکیده
Let j ≥ k ≥ 0 be integers. An `-L(j, k)-labelling of a graph G = (V , E) is a mapping φ : V → {0, 1, 2, . . . , `} such that |φ(u)−φ(v)| ≥ j if u, v are adjacent and |φ(u)−φ(v)| ≥ k if they are distance two apart. Let λj,k(G) be the smallest integer ` such that G admits an `-L(j, k)-labelling. Define λj,k(G) to be the smallest ` if G admits an `-L(j, k)-labelling with φ(V ) = {0, 1, 2, . . . , `} and∞ otherwise. An `-cyclic L(j, k)-labelling is a mapping φ : V → Z` such that |φ(u) − φ(v)|` ≥ j if u, v are adjacent and |φ(u) − φ(v)|` ≥ k if they are distance two apart, where |x|` = min{x, ` − x} for x between 0 and `. Let σj,k(G) be the smallest ` − 1 of such a labelling, and define σ j,k(G) similarly to λj,k(G). We determine λ2,0, λ2,0, σ2,0 and σ 2,0 for all Hamming graphs Kq1 Kq2 · · · Kqd (d ≥ 2, q1 ≥ q2 ≥ · · · ≥ qd ≥ 2) and give optimal labellings, with the only exception being 2q ≤ σ 2,0(Kq Kq) ≤ 2q+1 for q ≥ 4. We also prove the following ‘‘sandwich theorem’’: If q1 is sufficiently large then λ2,1(G) = λ2,1(G) = σ 2,1(G) = σ2,1(G) = λ1,1(G) = λ1,1(G) = σ 1,1(G) = σ1,1(G) = q1q2−1 for any graphG between Kq1 Kq2 and Kq1 Kq2 · · · Kqd , and moreover we give a labelling which is optimal for these eight invariants simultaneously. © 2009 Elsevier B.V. All rights reserved.
منابع مشابه
Labelling Cayley Graphs on Abelian Groups
For given integers j ≥ k ≥ 1, an L(j, k)-labelling of a graph Γ is an assignment of labels—nonnegative integers—to the vertices of Γ such that adjacent vertices receive labels that differ by at least j, and vertices distance two apart receive labels that differ by at least k. The span of such a labelling is the difference between the largest and the smallest labels used, and the minimum span ov...
متن کاملRecent progress in mathematics and engineering on optimal graph labellings with distance conditions
The problem of radio channel assignments with multiple levels of interference can be modelled using graph theory. The theory of integer vertex-labellings of graphs with distance conditions has been investigated for several years now, and the authors recently introduced a new model of real number labellings that is giving deeper insight into the problems. Here we present an overview of the recen...
متن کاملDISTANCE k COLORINGS OF HAMMING GRAPHS
A coloring of the vertices of a graph G is a distance k coloring of G if and only if any two vertices lying on a path of length less than or equal to k are given different colors. Hamming graphs are Cartesian (or box) products of complete graphs. In this paper, we will consider the interaction between coding theory and distance k colorings of Hamming graphs.
متن کاملConnections between labellings of trees
There are many long-standing conjectures related with some labellings of trees. It is important to connect labellings that are related with conjectures. We find some connections between known labellings of simple graphs.
متن کاملCharacterizing subgraphs of Hamming graphs
Cartesian products of complete graphs are known as Hamming graphs. Using embeddings into Cartesian products of quotient graphs we characterize subgraphs, induced subgraphs, and isometric subgraphs of Hamming graphs. For instance, a graph G is an induced subgraph of a Hamming graph if and only if there exists a labeling of E(G) fulfilling the following two conditions: (i) incident edges receive ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 157 شماره
صفحات -
تاریخ انتشار 2009